Identities for Tribonacci-related sequences
نویسنده
چکیده
We establish some identities relating two sequences that are, as explained, related to the Tribonacci sequence. One of these sequences bears the same resemblance to the Tribonacci sequence as the Lucas sequence does to the Fibonacci sequence. Defining a matrix that we call Tribomatrix, which extends the Fibonacci matrix, we see that the other sequence is related to the sum of the determinants of the 2nd order principal minors of this matrix. 1 Antefacts Let Sn be the generalized Lucas sequence, also called generalized Tribonacci sequence, that is Sn+1 = Sn + Sn−1 + Sn−2, S0 = 3, S1 = 1, S2 = 3. Sn is sequence A001644 in [2]. Let {α, β, γ} be the roots of the characteristics polynomial x3 −x2 −x− 1 = 0 (for an explicit expression see [1]). Let us assume that α is the real root, β and γ are the complex conjugate roots. We have α = 1.8392286..., |β| = |γ| = 0.737353... (see [3]). The Binet’s formula (see [1]) is
منابع مشابه
A Pascal-like Triangle Related to the Tribonacci Numbers
A tile composed of two pieces, which we refer to as a fence tile, is introduced to give the Tribonacci numbers a new combinatorial interpretation. The interpretation is used to construct a Pascal-like triangle and various identities concerning the triangle are proven. An intuitive proof of a general identity for the Tribonacci numbers in terms of sums of products of the binomial coefficients is...
متن کاملMore Identities On The Tribonacci Numbers
In this paper, we use a simple method to derive di¤erent recurrence relations on the Tribonacci numbers and their sums. By using the companion matrices and generating matrices, we get more identities on the Tribonacci numbers and their sums, which are more general than that given in literature [E. Kilic, Tribonacci Sequences with Certain Indices and Their Sum, Ars Combinatoria 86 (2008), 13-22....
متن کاملTribonacci Sequences With Certain Indices And Their Sums
In this paper, we derive new recurrence relations and generating matrices for the sums of usual Tribonacci numbers and 4n subscripted Tribonacci sequences, fT4ng ; and their sums. We obtain explicit formulas and combinatorial representations for the sums of terms of these sequences. Finally we represent relationships between these sequences and permanents of certain matrices. 1. Introduction Th...
متن کاملA Complete Categorization of When Generalized Tribonacci Sequences Can Be Avoided by Additive Partitions
A set or sequence U in the natural numbers is defined to be avoidable if N can be partitioned into two sets A and B such that no element of U is the sum of two distinct elements of A or of two distinct elements of B. In 1980, Hoggatt [5] studied the Tribonacci sequence T = {tn} where t1 = 1, t2 = 1, t3 = 2, and tn = tn−1 + tn−2 + tn−3 for n ≥ 4, and showed that it was avoidable. Dumitriu [3] co...
متن کاملOn generalized Tribonacci sequences and additive partitions
In this paper we give a partial description of the generalized Tribonacci sequences for which there exists a partition of the positive integers into two sets such that no two distinct elements of the same set sum to an element of the sequence. Prior work in this eld considered only the special case of the Tribonacci sequence.
متن کامل